Computation of integral bases

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computation of integral bases

Let A be a Dedekind domain, K the fraction field of A, and f ∈ A[x] a monic irreducible separable polynomial. For a given non-zero prime ideal p of A we present in this paper a new method to compute a p-integral basis of the extension of K determined by f . Our method is based on the use of simple multipliers that can be constructed with the data that occurs along the flow of the Montes Algorit...

متن کامل

Integral Function Bases

Integral bases, a minimal set of solutions to Ax ≤ b, x ∈ Zn that generate any other solution to Ax ≤ b, x ∈ Zn, as a nonnegative integer linear combination, are always finite and are at the core of the Integral Basis Method introduced by Haus, Köppe and Weismantel. In this paper we present one generalization of the notion of integral bases to the nonlinear situation with the intention of creat...

متن کامل

Computation of Difference Gröbner Bases

This paper is an updated and extended version of our note [1] (cf. also [2]). To compute difference Gröbner bases of ideals generated by linear polynomials we adopt to difference polynomial rings the involutive algorithm based on Janet-like division. The algorithm has been implemented in Maple in the form of the package LDA (Linear Difference Algebra) and we describe the main features of the pa...

متن کامل

Improved Computation of Involutive Bases

In this paper, we describe improved algorithms to compute Janet and Pommaret bases. To this end, based on the method proposed by Möller et al. [21], we present a more efficient variant of Gerdt’s algorithm (than the algorithm presented in [17]) to compute minimal involutive bases. Further, by using the involutive version of Hilbert driven technique, along with the new variant of Gerdt’s algorit...

متن کامل

Computation of Difference Groebner Bases

This paper is an updated and extended version of our note [1] (cf. also [2]). To compute difference Gröbner bases of ideals generated by linear polynomials we adopt to difference polynomial rings the involutive algorithm based on Janet-like division. The algorithm has been implemented in Maple in the form of the package LDA (Linear Difference Algebra) and we describe the main features of the pa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Number Theory

سال: 2016

ISSN: 0022-314X

DOI: 10.1016/j.jnt.2016.01.011